#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#include<functional>

using namespace std;

class Solution {
public:
    //快排法
    void quicksort(vector<int> &data, int begin, int end)
    {
        int num = data[begin];
        for(int i = begin; i < end; ++i)
        {
            if(data[i] <= num)
            {
                data[begin] = data[i];
                begin = i;
            }
            else
            {
                
            }
        }
    }
    //最小堆
    vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
        vector<int> res;
        if(input.size()<k) return res;
        priority_queue<int,vector<int>,greater<int> > heap;
        for(int num:input)
        {
            heap.push(num);
        }
        while(k){
            res.push_back(heap.top());
            heap.pop();
            k--;
        }
        return res;
    }
};

int main()
{

    return EXIT_SUCCESS;
}